منابع مشابه
Searching for an algebra on CSP solutions
The Constraint Satisfaction Problem (CSP) is a problem of computing a homomorphism R → Γ between two relational structures, where R is defined over a domain V and Γ is defined over a domain D. In fixed template CSPs, denoted CSP(Γ), the right side structure Γ is fixed and the left side structure R is unconstrained. In the last 2 decades it was impressively revealed that reasons that make fixed ...
متن کاملAbsorption in Universal Algebra and CSP
The algebraic approach to Constraint Satisfaction Problem led to many developments in both CSP and universal algebra. The notion of absorption was successfully applied on both sides of the connection. This article introduces the concept of absorption, illustrates its use in a number of basic proofs and provides an overview of the most important results obtained by using it. 1998 ACM Subject Cla...
متن کاملConformal Algebra and Physical States in a Non - Critical 3 - Brane on R ×
Abstract A world-volume model of a non-critical 3-brane is quantized in a strong coupling phase in which fluctuations of the conformal mode become dominant. This phase, called the conformal-mode dominant phase, is realized at very high energies far beyond the Planck mass scale. We separately treat the conformal mode and the traceless mode and quantize the conformal mode non-perturbatively, whil...
متن کاملCSP + Clocks: a Process Algebra for Timed Automata
We propose a real-time extension to the process algebra CSP. Inspired by timed automata, a very successful formalism for the specification and verification of real-time systems, we handle real time by means of clocks, i.e. real-valued variables that increase at the same rate as time. This differs from the conventional approach based on timed transitions. We give a discrete trace and failures se...
متن کاملStructured CSP - A Process Algebra as an Institution
We introduce two institutions for the process algebra Csp, one for the traces model, and one for the stable failures model. The construction is generic and should be easily instantiated with further models. As a consequence, we can use structured specification constructs like renaming, hiding and parameterisation (that have been introduced over an arbitrary institution) also for Csp. With a sma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1973
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1973-0318860-5